6 | 您所在的位置:网站首页 › 单链表结点删除 20 分 › 6 |
本题要求实现两个函数,分别将读入的数据存储为单链表、将链表中偶数值的结点删除。链表结点定义如下: struct ListNode { int data; struct ListNode *next; }; 函数接口定义: struct ListNode *createlist(); struct ListNode *deleteeven( struct ListNode *head ); 函数createlist从标准输入读入一系列正整数,按照读入顺序建立单链表。当读到−1时表示输入结束,函数应返回指向单链表头结点的指针。 函数deleteeven将单链表head中偶数值的结点删除,返回结果链表的头指针。 裁判测试程序样例: #include #include struct ListNode { int data; struct ListNode *next; }; struct ListNode *createlist(); struct ListNode *deleteeven( struct ListNode *head ); void printlist( struct ListNode *head ) { struct ListNode *p = head; while (p) { printf("%d ", p->data); p = p->next; } printf("\n"); } int main() { struct ListNode *head; head = createlist(); head = deleteeven(head); printlist(head); return 0; } /* 你的代码将被嵌在这里 */输入样例: 1 2 2 3 4 5 6 7 -1 输出样例: 1 3 5 7 typedef struct ListNode *List; struct ListNode *createlist() { //尾插法读入顺序建立链表,-1为结束符 List head=NULL, tail=NULL; int t; scanf("%d",&t); while(t != -1){ List temp = (List)malloc(sizeof(struct ListNode)); temp->data = t; temp->next = NULL; if(tail==NULL) head = tail = temp; else{ tail->next = temp; tail = temp; } scanf("%d",&t); } return head; } struct ListNode *deleteeven( struct ListNode *head ) { List p=head,q; while(head && head->data%2==0){ //保证头结点不是偶数 p = head; head = head->next; free(p); } //head空指针或者指向一个奇数节点,外层循环判断到结尾,内层循环连续删除 p = head; while(p && p->next){ while(p->next && p->next->data%2==0){ q = p->next; p->next = q->next; } p = p->next; } return head; }或者直接将所有奇数节点提取出来建立新的链表返回,而不是删除偶数节点 struct ListNode *deleteeven( struct ListNode *head ) { List newhead=NULL,p=head,tail; while(p){ if(p->data%2==1){ List temp = (List)malloc(sizeof(struct ListNode)); temp->data = p->data; temp->next = NULL; if(newhead==NULL) newhead = tail = temp; else{ tail->next = temp; tail = temp; } } p = p->next; } return newhead; } |
CopyRight 2018-2019 实验室设备网 版权所有 |